A Stochastic Parts Program and Noun Phrase Parser for Unrestricted Text
نویسنده
چکیده
It is well-known that part of speech depends on context. The word ‘‘table,’’ for example, can be a verb in some contexts (e.g., ‘‘He will table the motion’’) and a noun in others (e.g., ‘‘The table is ready’’). A program has been written which tags each word in an input sentence with the most likely part of speech. The program produces the following output for the two ‘‘table’’ sentences just mentioned:
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملA Noun Phrase Parser of English
A noun phrase parser is useful for several purposes, e.g. for index term generation in an information retrieval application; for the extraction of collocational knowledge from large corpora for the development of computational tools for language analysis; for providing a shallow but accurately analysed input for a more ambitious parsing system; for the discovery of translation units, and so on....
متن کاملRobust German Noun Chunking With a Probabilistic Context-Free Grammar
We present a noun chunker for German which is based on a head-lexicalised probabilistic contextfree grammar. A manually developed grammar was semi-automatically extended with robustness rules in order to allow parsing of unrestricted text. The model parameters were learned from unlabelled training data by a probabilistic context-free parser. For extracting noun chunks, the parser generates all ...
متن کاملAutomatic Semantic Sequence Extraction from Unrestricted Non-Tagged Texts
Mophological processing, syntactic parsing and other useflfl tools have been proposed in the field of natural language processing(NLP). Many of those NLP tools take dictionary-based approaches. Thus these tools are often not very efficient with texts written in casual wordings or texts which contain m a w domain-specific terms, because of the lack of vocabulary. In this paper we propose a simpl...
متن کاملA Block-Based Robust Dependency Parser For Unrestricted Chinese Text
Although substantial efforts have been made to parse Chinese, very few have been practically used due to incapability of handling unrestricted texts. This paper realizes a practical system for Chinese parsing by using a hybrid model of phrase structure partial parsing and dependency parsing. This system showed good performance and high robustness in parsing unrestricted texts and has been appli...
متن کامل